Context identification using a denoised signal

ABSTRACT

Denoising such as discrete universal denoising (DUDE) that scans a noisy signal in an attempt to characterize probabilities of finding symbol values in a particular context in a clean signal can perform a rough denoising on the noisy signal and identify contexts from a roughly denoised signal. The rough denoising improves estimation of the statistical properties of the clean signal by reducing the false differentiation of contexts that noise can otherwise create. Statistical information regarding occurrences of symbols in the noisy signal and corresponding contexts in the roughly denoised signal can then be used to denoise the noisy signal. The specifics of the rough denoising can be chosen based on knowledge of the noise or of the clean data. Alternatively, the DUDE can be used in an iterative fashion where the denoised signal produced from a prior iteration provides the contexts for the next iteration.

CROSS-REFERENCE TO RELATED APPLICATIONS

This patent document claims benefit of the earlier filing date of U.S. provisional patent application No. 60/611,169, filed Sep. 14, 2004, which is hereby incorporated by reference in its entirety.

BACKGROUND

A large body of mathematical and computational techniques has been developed in the area of reliable signal transmission through noise-introducing channels. These different techniques depend on assumptions made with regard to the noise-introducing channel, as well as on the amount and nature of information available, during denoising, regarding the original signal. The denoising process may be characterized by various computational efficiencies, including the time complexity and working-data-set complexity for a particular computational method, as well as by the amount of distortion, or noise, remaining in a recovered signal following denoising with respect to the originally transmitted, clean signal. Although methods and systems for denoising noisy signals have been extensively studied, and signal denoising is a relatively mature field, developers, vendors, and users of denoising methods and systems, and of products that rely on denoising, continue to recognize the need for improved denoising techniques.

SUMMARY

In accordance with an aspect of the invention, a denoising process includes: applying a first denoising process to a first signal to produce a second signal; selecting a current symbol from a first signal; identifying a current context that is in the second signal and associated with a position of the current symbol; and updating a data structure to reflect occurrence of the current symbol in the current context. The selecting, identifying, and updating steps can be repeated to complete generation of the data structure. A denoising of the first signal to generate a third signal can then use the data structure to determine when to replace a symbol in the first signal.

In accordance with another embodiment of the invention, a denoising system includes a modeler and a denoiser. The modeler, which is connected to receive a first signal and a second signal, processes the first signal to identify symbol values and processes the second signal to identify contexts respectively associated with the symbol values identified. From the symbol values and the contexts, the modeler generates a data structure that indicates probabilities for occurrences of symbols in contexts. The denoiser, which receives the data structure, the symbols from the first signal, and the contexts from the second signal, generates a third signal from the first signal by using the data structure to determine whether to replace a symbol in the first signal when generating the third signal.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates introduction of noise into a clean signal to produce a noisy signal and subsequent denoising of the noisy signal to produce a recovered signal.

FIGS. 2A, 2B, 2C, and 2D illustrate a motivation for a discrete, universal denoiser related to characteristics of the noise-introducing channel.

FIGS. 3A, 3B, 3C, and 3D illustrate a context-based, sliding window approach by which a discrete, universal denoiser characterizes the occurrences of symbols in a noisy signal.

FIG. 4 illustrates a convenient mathematical notation and data structure representing a portion of the metasymbol table constructed by a discrete, universal denoiser, as described with reference to FIGS. 3A to 3D.

FIGS. 5A, 5B, 5C, and 5D illustrate the concept of symbol-corruption-related distortion in a noisy or recovered signal.

FIG. 6 displays one form of a symbol-transformation distortion matrix A.

FIG. 7 illustrates computation of the relative distortion expected from replacing a symbol “a_(a)” in a received, noisy signal by the symbol “a_(x).”

FIG. 8 illustrates use of the column vector to compute a distortion expected for replacing the center symbol a_(a) in the metasymbol ba_(a)c in a noisy signal “s_(no)” by the replacement symbol a_(x).

FIG. 9 shows estimation of the counts of the occurrences of symbols “a,” to “an” for the clean signal.

FIG. 10 illustrates the process by which a discrete, universal denoiser denoises a noisy signal.

FIG. 11 illustrates an embodiment of the invention that determines difference contexts and context classes when denoising a continuous tone image.

FIG. 12A is a block diagram of a system in accordance with an embodiment of the invention for denoising of continuous tone images.

FIG. 12B is a block diagram of a system in accordance with an embodiment of the invention using rough denoising and/or iterative denoising to approximate the clean contexts for noisy symbols.

FIG. 13A is a flow diagram of a process in accordance with an embodiment of the invention capable of denoising continuous tone images.

FIG. 13B is a flow diagram of a process in accordance with an embodiment of the invention using rough and/or iterative denoising during modeling of a continuous tone image being denoised.

FIG. 14 is a flow diagram of a process for generating denoised data.

FIG. 15 is a flow diagram of a process in accordance with an embodiment of the invention that estimates an input probability vector without determining an inverse of a channel matrix.

FIG. 16 is a flow diagram of a process for eliminating negative components from an empirically determined input probability vector.

Use of the same reference symbols in different figures indicates similar or identical items.

DETAILED DESCRIPTION

Embodiments of the present invention are related to denoising methods and systems in general and to discrete, universal denoising systems and methods for data such as continuous tone images, audio data, and financial data where neighboring data tends to be related in a manner that suggests continuity. A general discrete, universal denoising method, referred to as “DUDE,” is described, below, in a first section. A second section describes exemplary embodiments of the present invention applied to denoising data signals in which different contexts for symbols can provide information regarding the characteristics of other contexts. A third section describes use of DUDE with rough or iterative denoising for improved modeling, and the fourth section describes exemplary channel inversion processes for some types of noise-introducing channels.

DUDE (or Discrete Universal DEnoising)

FIG. 1 illustrates introduction of noise into a clean signal 102 to produce a noisy signal 106 and subsequent denoising of noisy signal 106 to produce a recovered signal 110. For an illustrative example, signals 102, 106, and 110 are treated as linear, ordered sequences of symbols, such as a stream of alphanumeric characters that comprise a text file, but the data into which noise can be introduced include two-dimensional images, audio signals, video signals, and other types of displayed and broadcast information. In FIG. 1, signals 102, 106, 110 are represented as sequences of symbols that are each members of an alphabet A having n distinct symbols, where A is {a₁, a₂, a₃, . . . a_(n)}. Note that the subscripts of the symbols refer to the positions of the respective symbols within an ordered list of the symbols of the alphabet, and not to the positions of symbols in a signal. In FIG. 1, an initial, clean signal 102 comprises an ordered sequence of nine symbols from the alphabet A. In normal circumstances, an input signal may have thousands, millions, or more symbols. Input signal 102 is short for illustrative convenience.

Clean signal 102 is transmitted or passed through a noise-introducing channel 104, producing noisy signal 106. In the example shown in FIG. 1, noisy signal 106 includes symbols from the same alphabet A as input signal 102, although, in general, the input symbols may be chosen from a different, equally sized or smaller alphabet than that from which the output symbols are selected. In the example shown in FIG. 1, noise-introducing channel 104 alters a symbol 112 having value a₉ in the clean signal 102 to produce a corresponding symbol 114 having a₂ in the noisy signal 106.

There are many different types of noise-introducing channels, each type characterized by the types and magnitudes of noise that the noise-introducing channel introduces into a clean signal. Examples of noise-introducing channels include electronic communications media, data storage devices to which information is transferred and from which information is extracted, and transmission and reception of radio and television signals. In order to achieve reasonable fidelity for display, broadcast, or storage of a signal transmitted through a noise-introducing channel, a denoising process may be undertaken to remove noise that the noise-introducing channel introduced. In FIG. 1, noisy signal 106 is passed through or processed by a denoiser 108 to produce recovered signal 110, which, when the denoising process is effective, is substantially closer to, or more perceptually similar to, the originally transmitted clean signal 102 than to the received noisy signal 106.

Many types of denoisers have been proposed, studied, and implemented. Some involve application of continuous mathematics, some involve detailed knowledge of the statistical properties of the originally transmitted clean signal, and some rely on detailed information concerning time and sequence-dependent behavior of the noise-introducing channel. The following discussion describes a discrete, universal denoiser, referred to as “DUDE.” The DUDE is discrete in the sense that the DUDE processes signals comprising discrete symbols using a discrete algorithm, rather than continuous mathematics. The DUDE is universal in that it asymptotically approaches the performance of an optimum denoiser employing knowledge of the clean-signal symbol-occurrence distributions without access to these distributions.

A particular noise-introducing-channel model and a number of assumptions are generally employed in a DUDE implementation. These are discussed below. However, DUDE may effectively function when the model and assumptions do not, in fact, correspond to the particular characteristics and nature of a noise-introducing channel. Thus, the model and assumptions motivate the DUDE approach, but the DUDE has a much greater range of effectiveness and applicability than merely to denoising signals corrupted by a noise-introducing channel corresponding to the motivating model and assumptions.

In the DUDE, denoiser 108 of FIG. 1 employs a strategy for denoising noisy signal 106 that considers the context of each symbol. When the noisy signal is a linear sequence of symbols, the context generally comprising one or more symbols preceding and following the symbol according to a left to right ordering. For example, in FIG. 1, the two occurrences of the symbol “a₂” in the noisy signal 106 occur within the same single preceding-and-following-symbol context. The context for two occurrences 114 and 116 of the symbol “a₂” in noisy signal 106 of the example in FIG. 1 is [“a₃,” “a₁”]. Denoiser 108 either leaves all symbols of a particular type “a_(i)” within a particular context unchanged, or changes all occurrences of a particular type of symbol “a_(i)” within a particular context to a different symbol “a_(j).” For example, denoiser 108 replaced all occurrences 114 and 116 of the symbol “a₂” in noisy signal 106 within the full context [“a₃, “a₁”] with occurrences 118 and 120 of the symbol “a₉” in recovered signal 110. Thus, denoiser 108 does not necessarily produce a recovered signal identical to the originally transmitted clean signal 102, but instead produces a denoised, recovered signal 110 estimated to have less distortion with respect to clean signal 102 than does noisy signal 106. In the above example, replacement of the second symbol “a₂” at position 114 with the symbol “a₉” restores the originally transmitted symbol at that position, but replacement of occurrence 116 of symbol “a₂” in noisy signal 106 with the symbol “a₉” introduces a new distortion. Denoiser 108 only replaces one symbol with another to produce recovered signal 110 when denoiser 108 estimates that the overall distortion of recovered signal 110 with respect to clean signal 102 will be less than the distortion of noisy signal 106 with respect to clean signal 102.

FIGS. 2A to 2D illustrate a motivation for DUDE related to characteristics of the noise-introducing channel. DUDE assumes a memory-less channel. In other words, as shown in FIG. 2A, the noise-introducing channel 202 may be considered to act as a one-symbol window, or aperture, through which a clean signal 204 passes. The noise-introducing channel 202 corrupts a target clean-signal symbol by replacing the target symbol with another symbol in a noisy signal 206, with an estimateable probability that depends neither on the history of symbols preceding the target symbol through noise-introducing channel 202 nor on the symbols that are subsequently transmitted through noise-introducing channel 202.

FIG. 2B shows a portion of a table 210 that stores the probabilities that any particular symbol from the alphabet A, “a_(i),” may be corrupted to a symbol “a_(j)” during transmission through the noise-introducing channel. For example, in FIG. 2A, symbol 208 having clean value “a₆” is passing through noise-introducing channel 202. Row 216 in table 210 contains the probabilities that symbol “a₆” will be corrupted to each of the different, possible symbols in the alphabet A. For example, the probability 212 that the symbol “a₆” will be changed to the symbol “a₁” appears in the first cell of row 216 in table 210, indexed by the integers “6” and “1” corresponding to the positions of symbols “a₆” and “a₁” in the alphabet A. The probability 214 that symbol “a₆” will be faithfully transferred, without corruption, through noise-introducing channel 202 appears in the table cell with indices (6, 6). Note that the sum of the probabilities in each row of the table 210 is 1.0, since the noise-introducing channel will transmit a given symbol either faithfully or as some other symbol in an output alphabet A.

As shown in FIG. 2C, table 210 of FIG. 2B can be alternatively expressed as a two-dimensional matrix Π, with the matrix element identified by indices (i, j) indicating the probability that the noise-introducing channel will transmit symbol “a_(i)” as symbol “a_(j).” Note also that a column j in matrix Π may be referred to as a vector “π_(j)” or π_(a) _(j) .

As shown in FIG. 2D, a row vector 218 containing counts m_(C) of the number of each type of symbol in the clean signal, where, for example, the number of occurrences of the symbol “a₅” in the clean signal appears in the row vector as m_(C)[a₅], can be multiplied by the symbol-transition-probability matrix Π to approximate a row vector 222 containing the actual occurrence counts m_(N)[a_(i)] for each of the symbols a_(i) in the noisy signal 206. The actual occurrence counts of symbols “a_(i)” in the noisy signal appear in the row vector m_(N). The matrix multiplication is shown in expanded form 224 below the matrix multiplication in FIG. 2D. Thus, in vector notation: m_(C)·Π≈m_(N), where m_(C) is a row vector containing the occurrence counts of each symbol a_(i) in the alphabet in the clean signal; and m_(N) is a row vector containing the occurrence counts of each symbol a_(i) in the alphabet in the noisy signal.

The approximation symbol ≈ is employed in the equation m_(C)·Πm_(N,), because the probabilities in matrix Π give only the expected frequency of a particular symbol substitution, while the actual symbol substitution effected by the noise-introducing channel is random. In other words, the noise-introducing channel behaves randomly, rather than deterministically, and thus may produce different results each time a particular clean signal is transmitted through the noise-introducing channel. The error in the approximation, obtained as the sum of the absolute values of the components of the difference between the left and right sides of the approximation, above, is generally small relative to the sequence length, on the order of the square root of the sequence length. Multiplying, from the right, both sides of the above equation by the inverse Π⁻¹ of matrix Π, assuming that Π is invertible, allows for calculation of an estimated row-vector count of the symbols in the clean signal {circumflex over (m)}_(c), from the counts of the symbols in the noisy signal, as follows: {circumflex over (m)}_(c)≈m_(N)·Π. In the case where the noisy symbol alphabet is larger than the clean symbol alphabet, it is assumed that matrix Π is full-row-rank and the inverse Π⁻¹ in the above expression can be replaced by a generalized inverse, such as the Moore-Penrose generalized inverse.

As will be described below, the DUDE applies clean symbol count estimation on a per-context basis to obtain estimated counts of clean symbols occurring in particular noisy symbol contexts. The actual denoising of a noisy symbol is then determined from the noisy symbol's value, the resulting estimated context-dependent clean symbol counts, and a loss or distortion measure, in a manner described below.

As discussed above, the DUDE considers each symbol in a noisy signal within a context. In a 1-dimensional signal such as that used for the example of FIG. 1, the context may be the values of a number of symbols preceding, following, or both preceding and following a currently considered symbol. In 2-dimensional or higher dimensional signals, the context may be values of symbols in any of an almost limitless number of different types of neighborhoods surrounding a particular symbol. For example, in a 2-dimensional image, the context may be the eight pixel values surrounding a particular, interior pixel. For the description provided in this section, a 1-dimensional signal is used for examples, but the DUDE can effectively denoise higher dimensional signals such as data signals representing images.

In order to consider occurrences of symbols within contexts in the 1-dimensional-signal case, the DUDE needs to consider a number of symbols adjacent to each considered symbol. FIGS. 3A to 3D illustrate a context-based, sliding window approach by which the DUDE characterizes the occurrences of symbols in a noisy signal. FIGS. 3A to 3D all employ the same illustration conventions, which are described only for FIG. 3A, in the interest of brevity. In FIG. 3A, the DUDE analyzes a noisy signal 302 in order to determine the occurrence counts of particular symbols within particular contexts within noisy signal 302. The DUDE employs a constant k to describe the length of a sequence of symbols preceding, and the length of a sequence of symbols subsequent to, a particular symbol that, together with the particular symbol, may be viewed as a metasymbol of length 2k+1. In the example of FIGS. 3A to 3D, k has the value “2.” Thus, a symbol preceded by a pair of symbols and succeeded by a pair of symbols can be viewed as a five-symbol metasymbol. In FIG. 3A, the symbol “a₆” in position 304 occurs within a context of the succeeding k-length symbol string “a₉a₂” in positions 306 and is preceded by the two-symbol string “a₁a₃” in positions 308. The symbol “a₆” therefore occurs at least once in noisy signal 302 within the context [“a₁a₃,” “a₉a₂”], or, equivalently, the metasymbol “a₁a₃a₆a₉a₂” occurs at least once in noisy signal 302. The occurrence of this metasymbol within noisy signal 302 is listed within a table 310 as the first five-symbol metasymbol 312.

As shown in FIG. 3B, DUDE then slides the window of length 2k+1 rightward, by one symbol, to consider a second metasymbol 314 of length 2k+1. In this second metasymbol, the symbol “a₉” appears within the context [“a₃a₆,” “a₂a₁₇”]. This second metasymbol 314 is entered into table 310 as a second entry 316. FIG. 3C shows detection of a third metasymbol 318 in noisy signal 302 and entry of a third metasymbol into table 310 as entry 320. FIG. 3D shows the table 310 after DUDE completes analysis of short noisy signal 302. Although, in the examples shown in FIG. 3D, DUDE lists each metasymbol as a separate entry in the table, in a more efficient implementation, DUDE enters each detected metasymbol only once in an index table, and increments an occurrence count each time the metasymbol is subsequently detected. In this fashion, in a first pass, DUDE tabulates the frequency of occurrence of metasymbols within the noisy signal or, viewed differently, DUDE tabulates the occurrence frequency of symbols within contexts comprising k preceding and k subsequent symbols surrounding each symbol.

FIG. 4 illustrates a convenient mathematical notation and data structure representing a portion of the metasymbol table constructed by DUDE, as described with reference to FIGS. 3A to 3D. A column vector m(s_(no),b,c) in FIG. 4 represents counts of the occurrences of each symbol in the alphabet A within a particular context, represented by the k-length symbol vectors b and c, within a noisy signal s_(no), where 1-dimentional noisy signal s_(no) is viewed as a vector. As will be understood by those of skill in the art, the counts in vector m(s_(no),b,c) may be normalized if desired to produce probabilities. In FIG. 4, for example, the context value for which the occurrence counts are tabulated in column vector m(s_(no), b, c) comprises a symbol vector 404 and a symbol vector 406, where k has the value 3. In noisy signal s_(no) of FIG. 4, the symbol “a₃” in position 410 occurs within the context comprising three symbols 412 to the left of position 410 and three symbols 414 to the right of the position 410. This particular context has a value equal to the combined values of symbol vectors 404 and 406, denoted [“a₇a₃a₆,” “a₅a₅a₅”] and this occurrence of the symbol “a₃” 410 within the context [“a₇a₃a₆,” “a₅a₅a₅”], along with all other occurrences of the symbol “a₃” in the context [“a₇a₃a₆,” “a₅a₅a₅”], is noted by a count 416 within the column vector m(s_(no),b,c), with vector [b,c] equal to [“a₇a₃a₆,” “a₅a₅a₅”]. In other words, a symbol “a₃” occurs within the context [“a₇a₃a₆, “a₅a₅a₅”] in the noisy signal s_(no) 321 times in the of FIG. 4. The counts for the occurrences of all other symbols “a₁”, “a₂”, and “a₄” -“a_(n)” in the context [“a₇a₃a₆,” “a₅a₅a₅”] within noisy signal s_(no) are recorded in successive elements of the column vector m(s_(no), “a₇a₃a₆”, “a₅a₅a₅”). An individual count within a column vector m(s_(no), b,c) can be referred to using an array-like notation. For example, the count of the number of times that the symbol “a₃” appears in the context [“a₇a₃a₆,” “a₅a₅a₅”] within the noisy signal s_(no), 321, can be referred to as m(s_(no), “a₇a₃a₆”, “a₅a₅a₅”)[a₃].

DUDE employs either a full or a partial set of column vectors for all detected contexts of a fixed length 2k in the noisy signal in order to denoise the noisy signal. Note that an initial set of symbols at the beginning and end of the noisy signal of length k are not counted in any column vector m(s_(no), b,c) because they lack either sufficient preceding or subsequent symbols to form a metasymbol of length 2k+1. However, as the length of the noisy signal for practical applications tends to be quite large and the context length k tends to be relatively small, DUDE's failure to consider the first and final k symbols with respect to their occurrence within contexts makes almost no practical different in the outcome of the denoising operation.

FIGS. 5A to 5D illustrate the concept of symbol-corruption-related distortion in a noisy or recovered signal. The example of FIGS. 5A to 5D relates to a 256-value grayscale image of a letter. In FIG. 5A, the grayscale values for cells, or pixels, within a two-dimensional image 502 are shown, with the character portions of the symbol generally having a minimum grayscale value of 0 and the background pixels having a maximum grayscale value of 255, using a convention that the displayed brightness of the pixel increases with increasing numerical value. Visual display of the image represented by the two-dimensional grayscale signal in FIG. 5A is shown in FIG. 5B. The grayscale data in FIG. 5A is meant to represent a low resolution image of the letter “P.” As shown in FIG. 5B, the image of the letter “P” is reasonably distinct, with reasonably high contrast.

FIG. 5C shows the grayscale data with noise introduced by transmission through a hypothetical noise-introducing channel. Comparison of FIG. 5C to FIG. 5A shows that there is marked difference between the grayscale values of certain cells, such as cell 506 before and after transmission. FIG. 5D shows a display of the grayscale data from FIG. 5C. The displayed image is not easily recognizable as the letter “P.” In particular, two cells contribute greatly to the distortion: (1) cell 506, changed in transmission from the grayscale value “255” to the grayscale value “31”; and (2) cell 508, changed in transmission from the grayscale value “0” to the grayscale value “239.” Other noise, such as the relatively small magnitude grayscale changes of cells 510 and 512, introduces relatively little distortion and would have not seriously impacted recognition of the letter “P.” In this case, the distortion of the displayed image contributed by noise introduced into the grayscale data appears to be proportional to the magnitude of change in the grayscale value. Thus, the distorting effects of noise within symbols of a signal are not necessarily uniform. A noise-induced change of a transmitted symbol to a closely related, received symbol may produce far less distortion than a noise-induced change of a transmitted symbol to a very different, received symbol.

The DUDE uses a symbol-transformation matrix Λ to model the non-uniform distortion effects of particular noise-induced symbol transitions. FIG. 6 displays one form of the symbol-transformation distortion matrix Λ. An element d_(a) _(i) _(→a) _(j) of the matrix Λ provides the relative distortion incurred by substituting the symbol “a_(j)” in the noisy or recovered signal for the symbol “a_(i)” in the clean signal. An individual column j of the matrix Λ may be referred to as a vector λ_(j) or λ_(a) _(j) .

FIG. 7 illustrates computation of the relative distortion, with respect to the clean signal, expected from replacing a symbol “a_(a)” in a received, noisy signal by the symbol “a_(x)” As shown in FIG. 7, element-by-element multiplication of the elements of the column vectors λ_(a) _(x) and π_(a) _(a) , an operation known as the Schur product of two vectors, and designated in the current discussion by the symbol ⊙, produces a column vector λ_(a) _(x) ⊙π_(a) _(a) in which the i-th element is the product d_(a) _(i) _(→a) _(x) p_(a) _(i) _(→a) _(a) of a distortion and a probability reflective of the relative distortion expected in the recovered signal by replacing the symbol a_(a) in the noisy symbol by the symbol “a_(x)” when the symbol in the originally transmitted, clean signal is “a_(i).”

FIG. 8 illustrates use of column vector λ_(a) _(x) ⊙π_(a) _(a) to compute a distortion expected for replacing “a_(a)” in the metasymbol ba_(a)c in a noisy signal s_(no) by the replacement symbol “a_(x)”. In the following expression, and in subsequent expressions, the vectors s_(no) and s_(cl) respectively denote noisy and clean signals. A different column vector q can be defined to represent the occurrence counts for all symbols in the clean signal that appear at locations in the clean signal s_(cl) that correspond to locations in the noisy signal s_(no) around which a particular context [b, c] occurs. An element of the column vector q is defined in Equation 1, where s_(cl)[i] and S_(no)[i] denote the symbols at location i in the clean and noisy signals, respectively; and a_(a) is a symbol in the alphabet A. q(s _(no) ,s _(cl) ,b,c)[a _(a) ]=|{i,s _(cl) [i]=a _(a),(s _(no) [i−k], s _(no) [i−k+1], . . . , s _(no) [i−1])=b, (s _(no) [i+1], s _(no) [i+2], . . . , s _(no) [i+k])=c}|,   Equation 1

The column vector q(s_(no),s_(cl),b,c) includes n elements with indices a_(a) from “a₁” to “a_(n),” where n is the size of the symbol alphabet A. Note that the column vector q(s_(no),s_(cl),b,c) is, in general, not obtainable, because the clean signal, upon which the definition depends, is unavailable. Multiplication of the transpose q^(T)(s_(no),s_(cl),b,c) of the column vector q(s_(no),s_(cl),b,c) by the column vector λ_(a) _(x) ⊙π_(a) _(a) produces the sum of the expected distortions in the column vector times the occurrence counts in the row vector that together provide a total expected distortion for replacing “a_(a)” in the metasymbol ba_(a)c in signal s_(no) by “a_(x)”. For example, the first term in the sum is produced by multiplication of the first elements in the row vector by the first element in the column vector, resulting in the first term in the sum being equal to q^(T)(s_(no),s_(cl),b,c)[a₁](p_(a) _(i→) _(a) _(a) d _(a1→) _(a) _(x) ) or, in other words, a contribution to the total distortion expected from replacing “a_(a)” with “a_(x)” in all occurrences of ba_(a)c in signal s_(no) when the corresponding symbol in signal s_(cl) is a₁. The full sum gives the full expected distortion: q ^(T)(s _(no) ,s _(cl) , b,c)[a ₁](p _(a) _(1→) _(a) _(a) d _(a) _(1→) _(a) _(x) )+q ^(T)(s _(no) ,s _(cl) ,b,c)[a ₂](p _(a) _(2→) _(a) _(a) d _(a) _(2→) _(a) _(x) )+q ^(T)(s _(no) ,s _(cl) ,b,c)[a ₃](p _(a) _(3→) _(a) _(a) d _(a) _(3→) _(a) _(x) )+ . . . +q ^(T)(s _(no) ,s _(cl) ,b,c)[a _(n)](p _(a) _(n→) _(a) _(a) d _(a) _(n→) _(a) _(x) )

As discussed above, DUDE does not have the advantage of knowing the clean signal input to the noise-introducing channel that produced the received noisy signal. Therefore, DUDE estimates the occurrence counts, q^(T)(s_(no),s_(cl),b,c), of symbols in the originally transmitted, clean signal, by multiplying the row vector m^(T)(s_(no), b, c) by Π⁻¹ from the right. FIG. 9 shows estimations of the counts of the occurrences of symbols “a₁” to “a_(n)” for the clean signal.

The resulting expression m^(T)(s_(no),b,c)Π⁻¹(λ_(a) _(x) ⊙π_(a) _(a) ) obtained by substituting m^(T)(s_(no),b,c)Π⁻¹ for q^(T)(s_(no),s_(cl),b,c) represents the DUDE's estimation of the distortion, with respect to the originally transmitted clean signal, produced by substituting “a_(x)” for the symbol “a_(a)” within the context [b, c] in the noisy signal s_(no). DUDE denoises the noisy signal by replacing “a_(a)” in each occurrence of the metasymbol ba_(a)c by that symbol “a_(x)” providing the least estimated distortion of the recovered signal with respect to the originally transmitted, clean signal, using the above expression. In other words, for each metasymbol ba_(a)c, DUDE employs the transfer function g^(k)(b, a_(a), c) of Equation 2 to determine how to replace the central symbol a_(a) In some cases, the minimum distortion is produced by no substitution or, in other words, by the substitution a_(x) equal to a_(a). Equation  2: ${g^{k}\left( {b,a_{\alpha},c} \right)} = {\underset{a_{x} = {a_{1}\quad{to}\quad a_{n}}}{argmin}\left\lbrack {{m^{T}\left( {s_{no},b,c} \right)}{\prod\limits^{- 1}\left( {\lambda_{a_{x}} \odot \pi_{a_{\alpha}}} \right)}} \right\rbrack}$

FIG. 10 illustrates the process by which DUDE denoises a noisy, received signal. First, as discussed above, DUDE compiles counts for all or a portion of the metasymbols comprising each possible symbol “a_(i)” within each possible context [b, c]. As discussed above, the counts are stored in column vectors m(s_(no),b,c). In the next pass, DUDE again passes a sliding window over a noisy signal 1002. For each metasymbol, such as metasymbol 1004, DUDE determines the relative distortions of the recovered signal with respect to the clean signal that would be produced by substituting for the central character “a_(a)” of the metasymbol each possible replacement symbol “a_(i)” in the range i=1 to n. These relative distortions are shown in table 1006 in FIG. 10 for metasymbol 1004 detected in noisy signal 1002. Examining the relative distortion table 1006, DUDE selects the replacement symbol with the lowest relative distortion, or, in the case that two or more symbols produce the same relative distortions, selects the first of the multiple replacement symbols with the lowest estimated distortion. In the example shown in FIG. 10, that symbol 1008 is “a₃”. DUDE then replaces the central symbol “a_(a)” at position 1010 in noisy signal 1002 with the selected replacement symbol “a₃” at the corresponding position 1012 in the recovered signal 1014. Note that recovered signal 1014 is generated from independent considerations of each type of metasymbol in noisy signal 1002, so that the replacement symbol selected in a previous step does not affect the choice for a replacement symbol in a next step for a different metasymbol. In other words, the replacement signals are generated in parallel, rather than after substitution of symbols directly into the noisy signal. As with any general method, the above-described method by which DUDE denoises a noisy signal can be implemented using various data structures, indexing techniques, and algorithms to produce a denoising method that has both linear time and linear working-data-set complexities or, in other words, the time complexity is related to the length of the received, noisy signal, by multiplication by a constant, as is the working-data-set complexity.

The examples employed in the above discussion of DUDE are primarily 1-dimensional signals. However, as also discussed above, DUDE may also denoise 2-dimensional and multi-dimensional signals. In the 2-and-multi-dimensional cases, rather than considering symbols within a 1-dimensional context, symbols may be considered within a contextual neighborhood. For example, the pixels adjacent to a currently considered pixel in a 2-dimensional image may together comprise the contextual neighborhood for the currently considered symbol, or, equivalently, the values of a currently considered pixel and adjacent pixels may together comprise a 2-dimensional metasymbol. In a more general treatment, the expression m^(T)(s_(no),b,c)Π⁻¹(λ_(a) _(x) ⊙π_(a) _(a) ) may be replaced by the more general expression m^(T)(s_(no),η)Π⁻¹(λ_(a) _(x) ⊙π_(a) _(a) ) where components of the vector η are the symbol values in a particular contextual neighborhood.

The neighborhood may more generally be defined according to various criteria, including proximity in time, proximity in display or representation, or according to any arbitrary, computable metric, and may have various different types of symmetry. For example, in the above-discussed 1-dimensional-signal examples, symmetric contexts comprising an equal number of symbols k preceding and following a currently considered symbol compose the neighborhood for the currently considered symbol, but in other cases, a different number of preceding and following symbols may be used for the context, or symbols either only preceding or following a current considered symbol may be used.

Context-Based Denoising of Data with Simultaneous Update of Multiple Probabilities

DUDE as discussed in the section above can denoise one-dimensional or multi-dimensional data structures with any size alphabet of symbols. However, best denoising performance is achieved when count vectors m(s_(no),η) extracted from a noisy signal s_(no) have component counts that are large enough to provide a reliable statistical characterization of the noisy signal s_(no). Multi-dimensional data structures with possibly large alphabet such as continuous tone images present challenges to achieving adequate statistics. For example, a grayscale continuous tone image typically uses an alphabet containing 256 symbols, i.e., the 8-bit values from 0 to 255, and a color continuous tone image commonly uses an alphabet containing millions of symbols, e.g., 24-bit values from (0,0,0) to (255,255,255). Further, a context η that includes the neighboring symbols up to k pixel away from a central symbol in a two-dimensional array includes (2k+1)²−1 pixels (e.g., 8, 24, . . . pixels for k=1, 2, . . . ). These typical denoising scenarios for continuous tone images can thus require count vectors m(s_(no),η) associated with 256⁸ to 256^(3*24) different contexts η. The large number of symbols and large number of possible contexts η of each symbol can thus require a very large data sample to provide good statistics when determining the count vectors m(s_(no),η) used in the denoising process.

In accordance with an aspect of the invention, a denoising process can use each appearance of a context η to simultaneously update the count vectors m(s_(no),η_(i)) for many different contexts η_(i). In particular, the count vectors m(s_(no),η_(i)) for a set of contexts η_(i) can be updated whenever the appearance of a symbol in a context η indicates something about the statistical behavior of the other contexts η_(i). The denoising process can thus provide better count statistics because each occurrence of a context can contribute to the determination of a large number of count vectors. One exemplary denoising process embodying this aspect of the invention is based on DUDE and accumulates a single count vector for a set of contexts that produce the same value of a context function C(η). The context function C(η) is preferably chosen so that all contexts η that produce the same value of context function C(η) are expected to have similar statistics in the noisy signal s_(no). The set of contexts η having the same value of a context function C(η) are sometime referred to herein as a context class.

One simple example of a context function C(η) corresponds to quantizing the contexts η. In particular, the context function C(η) can be such that contexts η in the same quantization bin correspond to the same value of context function C(η) and contexts η in different bins correspond to different values of context function C(η). Known vector or scalar quantization techniques can be employed. An example of quantization of a grayscale image in which each symbol is an 8-bit value uses a context function C(η) that maps context vectors η to context vectors η′ resulting from replacement of each 8-bit component of each context η with a value corresponding to a bin containing the 8-bit value. For example, each 8-bit component of the context vector η can be assigned a bin value corresponding to the three most significant bits (MSB) of the 8-bit component. As a result, this context function C(η) maps 256²⁴ different 24-symbol contexts down to 8²⁴ different context classes.

In accordance with another aspect of the invention, known features of a data signal being denoised can be used to identify the context classes that group together contexts having similar statistical characteristics. For example, one common feature that can be expected for many data signals is homogeneity. In particular, data signals representing images, audio, or the time or spatial dependence of most systems may exhibit some form of homogeneity. Homogeneity in general implies that particular sections of data include similar slow variations in symbol value even though separated sections may differ significantly in a base value. Accordingly, a context may be best characterized by their variations relative to the base value of the context. A context function C(η) exploiting this property can map contexts that differ in base value but have similar variations to the same context class. The context function C(η) can additionally use the symmetry in the data signal to identify contexts belonging in the same context class. In particular, data representing dependence on time or another linear parameter may have the same characteristics independent of whether considered in a forward or backward order. For data representing spatial variation, contexts that are rotations or reflections of each other may be expected to show similar statistics and therefore can be mapped to the same context class.

In order to provide an illustrative example, this section concentrates on the example of denoising continuous tone images, but it should be understood that denoising processes disclosed here can more generally be applied to other data signals. For the example of data representing a continuous tone image, portions of the image away from object edges may be expected to include similar slow variations in color even though separated regions may differ significantly in base color. Accordingly, a context of a pixel value may be best characterized by the color or gray level variations relative to a base color or gray level. A context function C(η) exploiting this property can map contexts that differ in base color but have similar color variations to the same context class. The context function C(η) can additionally use the symmetry common to natural images to identify contexts belonging in the same context class. In particular, contexts that are rotations or reflections of each other would be expected to show similar statistics in a natural image and therefore can be mapped to the same context class.

FIG. 11 illustrates an example of a pixel map 100 for a continuous tone grayscale image in which the symbols are integers from 0 to 255 and represent levels of image intensity. For the purpose of illustration, pixel map 1100 contains mostly clean data with relatively few symbols that are corrupted by noise, but more generally, a pixel map to which denoising is being applied could contain considerably more noise than is illustrated. In the example of FIG. 11, intensities in a background region of pixel map 1100 happen to vary almost continuously along a diagonal from the top-left to the bottom-right of pixel map 1100. In contrast, an object 1110 in pixel map 1100 has relatively high pixel values, which may correspond to object 1110 being in front of a darker background. Pixel map 1100 illustrates a common property of natural images in that objects and backgrounds tend to have regions in which color varies slowly and edges at which colors may change abruptly. Further, the slow variations in different regions are often the result of the same effects such as the illumination angle or other lighting effects.

A context function C(η) for a pixel map can identify a context class as containing contexts with similar variations in color or brightness. For example, context function C(η) can map each context vector η having the same quantized version Q(Δη) of a context vector difference Δη to the same context class. In an exemplary embodiment, the context vector difference Δη represents the difference between a context vector η and a base symbol {overscore (η)} for context vector η. The base symbol {overscore (η)} for a context vector η in general is a symbol that characterizes the context overall and can be defined, for example, to be the maximum, the minimum, the mean, or a weighted or unweighted average of the component symbols in the context vector η.

Pixel map 1100 of FIG. 11 contains a neighborhood 1121 having a context vector η₁ and a base symbol {overscore (η)}₁. In this example, base symbol {overscore (η)}₁ is equal to 24, which is the average of the components of context vector η₁. The context vector difference Δη₁ has relatively small components, which is to be expected for a region having a continuous color variation. Quantization of context vector difference Δη₁ can, for example, set the small components of context vector difference Δη₁ equal to the nearest integer value, which in this case makes no change. In neighborhood 1121, the central pixel found in context η₁ happens to have a level equal to base symbol {overscore (η)}₁. More generally, the pixel value in context η₁ may be similar to the components of context vector η₁ when the context η₁ is away from an edge of an object, but the pixel in context η₁ could have any symbol value.

FIG. 11 also shows a neighborhood 1122 in pixel map 1100 having a context vector η₂ and a base symbol {overscore (η)}₂ equal to 36, which is the average of the components of context vector η₂. The pixel found in context η₂ in neighborhood 1122 is equal to 255 and in this example differs significantly from base symbol {overscore (η)}₂, possibly due to channel-induced noise. Although the component symbols of contexts η₁ and η₂ differ and base symbols {overscore (η)}₁ and {overscore (η)}₂ differ, the context vector differences Δη₁ and Δη₂ are the same after quantization, i.e., Q(Δη₁)=Q(Δη₂). As a result, the occurrences of contexts η₁ and η₂ can contribute to a class count vector M(s_(no),C(η₁)) corresponding to a context class C(η₁) including contexts η₁, η₂, and all other contexts that after a permitted symmetry transformation produce the same quantized context vector difference Q(Δη₁).

The edge of object 1110 in pixel map 1100 crosses through a neighborhood 1123 having a context vector η₃. As described above, one rule for identifying a context class selects a base symbol {overscore (η)}₃ for a context vector η₃, e.g., the average of the components of context vector η₃. However, the average may not be a particularly useful or characteristic value for a context that contains an edge of an object, and predictors associated with edge location may be used to better identify contexts that should be in the same class. Predictors in general are known in image and audio compression, and the specifics of the particular predictor used in a denoising process may be selected according to the noisy channel. However, for illustration, a quantized context vector difference Q(Δη₃) can still be calculated as shown in FIG. 11 using a base value {overscore (η)}₃ such as the average 49.25, which is not in the alphabet, or alternatively by selecting a symbol that is near the average and from the alphabet (e.g., 49). As illustrated in FIG. 11, the quantization that takes the context vector difference Δη₃ to a quantized vector difference Q(Δη₃) can be a non-linear quantization that is coarser for large components. Quantized context vector difference Q(Δη₃) clearly differs from quantized context vector differences Q(Δη₁) and Q(Δη₂) and therefore contributes to a different class count vector M(s_(no),C(η₃)). This distinction of context classes is desirable because the statistics of a context vector η₃ that is at an edge of an object 1110 may differ from the statistics of context vector η₁ and η₂ that are away from any edges.

Each class count vector M(s_(no),C(η₃)) as noted above can be updated for each occurrence of a context η or any other context η′ providing the same value of the context function, i.e., any context η′ such that C(η′)=C(η). The particular component count of class count vector M(s_(no),C(η)) updated for an occurrence of a context in the class C(η) depends on the symbol value a found in the context η. In one embodiment of the invention, the updated component when a symbol a is found in a context η has an index corresponding to a difference between the symbol a and an index base symbol {double overscore (η)}, where the index base symbol {double overscore (η)} depends on the context η. Index base symbol {double overscore (η)} in general may be the same as or different from the base symbol {overscore (η)} used to determine the context vector difference Δη. In the case where a symbol difference a−{double overscore (η)} identifies the component, the class count vector M(s_(no),C(η)) can be of dimension 2n where n is the number of symbols in the alphabet. Accordingly, the count vectors m(s_(no),η) having the proper dimension for use in the DUDE may have fewer components than class count vectors M(s_(no),C(η)), but the count vectors m(s_(no),η) can be derived from the corresponding class count vector M(s_(no),C(η)) as described further below.

Another view of the exemplary modeling process is that for each symbol that occurs in context η₁, which has an index base symbol {double overscore (η)}₁, all count vectors m(s_(no),η) that are associated with the same context class as context η₁ are simultaneously updated. In an exemplary embodiment, for each appearance of symbol a in context η₁, the incremented count in a count vector m(s_(no),η₂) for a similar context η₂ having index base symbol {double overscore (η)}₂ will be the count vector component corresponding to symbol a={double overscore (η)}₁+{double overscore (η)}₂, which may be clamped at the extreme range of the alphabet. As a result, two contexts η₁ and η₂ in the same context class C(η) have the substantially same count vector m(s_(no),η) except that the components of count vector m(s,η₁) are shifted by {double overscore (η)}₁−{double overscore (η)}₂ relative to the components of count vector m(s,η₂). This process is equivalent to defining class count vectors M(s_(no),C(η)) for context classes C(η).

More generally, viewing the individual count vectors m(s_(no),η) as being related to one another allows for more general ways of collecting statistics. For example, contexts need not be clustered into disjoint classes, but instead the choice of which contexts are affected by the appearance of a symbol in context η₁ may depend on other factors. Also, the computation of the vector entry that is affected may involve transformations other than the above shift. For example, a multiplicative factor may map components of different count vectors m(s_(no),η₁) and m(s_(no),η₂) in a case where a symbol appears in a context η₁ that has some “energy level” and is used to update a count in a context η₂ that has a different energy level.

FIG. 12A illustrates a block diagram for a continuous-tone DUDE system 1200. System 1200 includes a modeler 1210, and a denoiser 1220. Denoiser 1220 generally employs a channel model 1222 that can be selected to model a physical noise-inducing channel and a cost model 1224 that models cost or distortion that results from replacement of symbols in the clean signal s_(cl). The blocks of system 1200 can be implement, for example, using software or firmware routines executed in a special-purpose or general-purpose computer, such software when stored on a machine-readable medium, hardwired units electronically performing the tasks described below, or any combination of these.

Modeler 1210 receives and scans the noisy signal s_(no). During a modeling pass, modeler 1210 assigns each context η found in the noisy signal s_(no) to a context class C(η) and models the noisy signal by constructing the class count vectors M(s_(no),C(η)). The number of context classes and the characteristics of each context class generally depend on the modeling schemes used to characterize the image. Examples of some modeling schemes defining context classes are described above and further below.

Denoiser 1220 uses the noisy signal s_(no), the class count vectors M(s_(no),C(η)) from modeler 1210, channel model 1222, and cost or distortion model 1224 to select replacement symbols used in a recovered signal s_(rc). Channel model 1222 corresponds to the symbol-transition-probability matrix or channel matrix Π described above and can be used to model different types of channel noise such as Gaussian noise or impulse noise. Cost model 1224 corresponds to the symbol-transformation distortion matrix Λ described above.

FIG. 13A is a flow diagram of a denoising process 1300 that uses the variation of symbol values to distinguish context classes of a continuous tone image. The continuous tone image may, for example, be a grey scale or color image represented by one or more two-dimensional array of pixel values. Color images are often represented using three pixel maps corresponding to different color component, e.g., R, G, and B or Y, U, and V color component maps, and each component map can be modeled separately. For color images, the two-dimensional arrays of symbols corresponding to different color components may be denoised separately or using correlations among the arrays.

Denoising process 1300 is a two-pass process including a modeling pass 1310 and a denoising pass 1320. Modeling pass 1310, which can be implemented in modeler 1210 of FIG. 12A, scans through the noisy signal s_(no), e.g., pixel map 1100, to determine class count vectors M(s_(no),C(η)) associated with the context classes C(η). A denoising pass 1320, which can be implemented in denoiser 1220 of FIG. 12A, scans through the noisy signal and replaces individual symbols a_(a) with symbols a_(x) that cause minimal estimated overall distortion, e.g., with replacements that minimize m^(T)(s_(no),η)Π⁻¹(λ_(a) _(x) ⊙π_(a) _(a) ) as described above.

Modeling pass 1310 begins in step 1312 with selection or identification of a current symbol a and context η from the noisy signal s_(no), e.g., from the pixel map representing the continuous tone image being evaluated. The first symbol selected will generally depend on the size of context η and on a selected order for scanning of the continuous tone image. In an exemplary embodiment, each context η includes 24 symbols corresponding to pixels within a radius of two pixels from the current symbol a, and a common scanning order begins with a context at a top-left corner of a pixel map being scanned. However, any size or shape contexts and any desired order for scanning can be used.

Steps 1313, 1314, and 1316 then respectively determine a base symbol {overscore (η)}, a quantized difference context Q(Δη), and an index base symbol {double overscore (η)} for the current context η. Such values can normally be calculated from the components of the current context η. Base value {overscore (η)}, for example, can be any desired function of the component symbols of the current context η. In an exemplary embodiment, base symbol {overscore (η)} is the average of the components of the current context η, but the base symbol {overscore (η)} could alternatively be the mean, the minimum, the maximum, or generally any function of the symbol values in context η. Index base symbol {double overscore (η)} could similarly be any function of the components of the current context η, but in an exemplary embodiment of the invention, index base symbol {double overscore (η)} is equal to base symbol {overscore (η)}.

Step 1314 determines quantized difference context Q(Δη) from the current context η and base value {overscore (η)}, for example, by subtracting base value {overscore (η)} from each of the components of current context η, quantizing the resulting difference vector, and arranging the resulting difference components in a standard order, e.g., with largest components in the top left quadrant of the difference array. The resulting quantized difference context Q(Δη) provides a measure of color variation in the current context η and is useful in defining context classes that group together contexts expected to have similar statistical characteristics in a natural image. For grayscale images, the symbols are generally strictly positive integers but subtraction of base value {overscore (η)} from strictly positive components of current context η can make some components of difference context Δη negative. More generally, determining difference context Δη can extend the range of components of difference context Δη beyond the range of the alphabet of symbols, but quantization still reduces the number of different quantized difference contexts to improve the statistics of modeling pass 1310.

Step 1317 identifies a context class C(η) corresponding to the current context η and increments a component of the class count vector M(s_(no),C(η)) associated with the current context class C(η), the current symbol a, and the index base symbol {double overscore (η)} identified in step 1316. Using the quantized context difference Q(Δη) in identification of context class C(η) can take advantage of expected image homogeneity or continuity characteristics. Additionally, using a standard ordering of components in quantized context difference Q(Δη) can exploit expected small-scale symmetry, e.g., invariance under rotations and/or reflections. Such symmetry allows the reordering of the components of difference context Δη in a manner that lumps difference contexts that differ by a symmetric transform, e.g., by a rotation or reflection, into the same context class. For example, using the two-dimensional relationship that the image imposes on the components of a difference context Δη, each difference context Δη can be rotated or flipped so that the components with the greatest magnitude are in specified quadrants, e.g., in the upper left quadrant of the array of components corresponding to difference context Δη.

Any desired quantization or categorization can then be applied to difference context Δη to define bins corresponding to the context classes C(η). For example, scalar quantization can be separately applied to each component of difference context Δη or a vector quantization technique such as used in LBG compression processes can be applied to difference context Δη. In an exemplary embodiment of the invention, the quantization or categorization defines a small number of bins (e.g., 64 to 512 bins) for all difference contexts Δη. A non-uniform quantization process for difference contexts Δη can be selected to provide a larger number of bins for difference contexts having small component values and relatively fewer bins for difference contexts having large component values. The non-uniform quantization reflects the property that a difference context Δη in a region of slowly varying color (e.g., a region away from a boundary) typically will have small component values, while a rarer difference context Δη corresponding to a region containing a boundary in the image typically will have larger component values.

In general, the number of components in class count vector M(s_(no),C(η)) can differ from the number of components of count vectors m(s_(no),η). In particular, the number of components in each count vector m(s_(no),η) is equal to the number of symbols in the alphabet for the noisy signal s_(no). In a preferred embodiment, the components of class count vector M(s_(no),C(η)) are identified by symbol differences a-{double overscore (η)}, where the index base value {double overscore (η)} depends on the context η and may be the same as or different from the base values {overscore (η)} used to determine difference context Δη. In a special case where index base value {double overscore (η)} is zero, each class count vector M(s_(no),C(η)) has the same number of components as each count vector m(s_(no),η), but each class count vector M(s_(no),C(η)) more generally has up to twice as many components as each count vector m(s_(no),η).

Step 1318 determines whether the current context η is the last context in the order of scanning during modeling pass 1310. If not, modeling pass 1310 branches back to step 1312 and selects the next context as the current context η and repeats steps 1312, 1313, 1314, 1316, 1317, and 1318. When step 1318 determines that the last context has been evaluated, modeling pass 1310 is complete. The result of modeling pass 1310 is a set of class count vector M(s_(no),C(η)) respectively for the context classes C(η).

Denoising pass 1320 scans through the noisy signal s_(no) and generates a reconstructed signal s_(rc) representing a denoised image. In denoising pass 1320, step 1322 selects a current symbol a_(a) and context η for evaluation. Step 1323 identifies the class count vector M(s_(no),C(η)) that modeling pass 1310 found for the current context η, and then step 1324 constructs a count vector m(s_(no),η) for the current context η. More specifically, step 1323 identifies the context class C(η) corresponding to context η, and accesses the class count vector M(s_(no),C(η)) corresponding to context class context class C(η). Step 1324 then constructs count vector m(s_(no),η) from class count vector M(s_(no),C(η)). This construction can be achieved, for example, shifting class count vector M(s_(no),C(η)) by the index base value {double overscore (η)} for the current context η, truncating or clamping the set of components of the shifted class count vector to the required symbol range, and renormalizing the resultant count vector m(s_(no),η) if necessary.

The DUDE process as described above selects a replacement a_(x) that minimizes a measure m^(T)(s_(no),η)Π⁻¹(λ_(a) _(x) ⊙π_(a) _(a) ) of the estimated distortion. Step 1326 uses the determined count vector m(s_(no),η) to find a replacement symbol a_(x) causing the minimum of estimated image distortion m^(T)(s_(no),η)Π⁻¹(λ_(a) _(x) ⊙π_(a) _(a) ) when replacing a symbol a_(a) in context η in noisy signal s_(no). As noted above, this minimization process will generally depend on the choice of a model for the noisy channel (i.e., the choice of symbol-transition-probability or channel matrix Π) and the choice of cost or distortion model (i.e., the choice of λ_(a) _(x) ). Step 1327 then uses the minimizing symbol a_(x) in the generated symbols of the reconstructed signal s_(rc) representing the denoised image.

In accordance with an aspect of the invention, a denoising pass for a noisy channel having a near-circulant channel matrix Π can avoid evaluating the matrix product m^(T)(s_(no),η)Π⁻¹(λ_(a) _(x) ⊙π_(a) _(a) ) for each context η. In particular, if channel matrix Π is circulant (or nearly circulant), which is the case for a channel introducing Gaussian noise, a product M^(T)(s_(no),C(η))Π⁻¹ can be evaluated only once per context class C(η). When denoising pass 1320 later encounters a context η, the quantity m^(T)(s_(no),η)Π⁻¹ can be found by shifting components of the already calculated and saved product M^(T)(s_(no),C(η))Π⁻¹. The quantity m^(T)(s_(no),η)Π⁻¹ found from a shift can then be used in the determination of a replacement symbol a_(x) causing the minimum of estimated image distortion m^(T)(s_(no),η) Π⁻¹(λ_(a) _(x) ⊙π_(a) _(a) ) when replacing a symbol a_(a) in context η in noisy signal s_(no). This provides a huge complexity saving by converting a matrix multiplication to a shift operation.

Step 1328 checks whether the current symbol/pixel is the last to be denoised. If not, denoising pass 1320 branches back to step 1322 and selects another current symbol a_(a) and current context η from the noisy signal s_(no). Denoising process 1300 is complete after the last pixel or symbol has been selected and denoised.

DUDE with Rough or Iterative Denoising for Improved Modeling

As described above, a modeling pass for DUDE can scan a noisy signal s_(no) to generate count vectors m(s_(no),η) or class count vectors M(s_(no),C(η)) that statistically characterize the noisy signal s_(no). The available contexts during the modeling pass are from the noisy signal s_(no) and include neighboring “noisy” symbol values. The contexts may thus be contaminated with errors, so that two contexts in the noisy signal s_(no) may differ from each other even when the corresponding contexts in the clean signal s_(cl) are identical. The modeling process can still learn about channel-induced errors that occur in similar or identical contexts if given enough data. In particular, the errors in the contexts do not prevent the modeling process from accurately characterizing the noisy signal s_(no), so that the denoising process asymptotically approaches the optimal denoising solution. However, in a non-asymptotic regime, i.e., a short noisy signal s_(no), noise in the component symbols of the contexts may make identification of similar context more difficult and is therefore a source of modeling inefficiency.

In accordance with an aspect of the present invention, a denoising system can apply “rough” denoising to the noisy signal s_(no) to roughly clean the symbols that are used to identify matching contexts, e.g., contexts that are the same or in the same context class. This rough denoising can employ prior knowledge of the system such as knowledge of the noise-inducing channel and/or of statistical properties of the original data. For example, if a channel is known to introduce impulse noise into a grayscale image, the noisy image can be roughly denoised using a median filter, which is effective at reducing impulse noise. In accordance with a further aspect of the invention, the DUDE itself can act as a filter for rough denoising that is performed iteratively to remove noise from the contexts used in modeling during a subsequent iteration.

FIG. 12B illustrates a block diagram for DUDE system 1250 using rough denoising to improve modeling of a noisy signal s_(no). System 1200 includes a filter 1230, a modeler 1210, and a denoiser 1220. Exemplary implementations of the blocks of system 1200 include software or firmware routines executed in a general-purpose computer, such software when stored on a machine-readable medium, hardwired units electronically performing the tasks described below, or any combination of these.

Filter block 1230 receives the noisy signal s_(no) representing a continuous tone image (or other data) and performs rough denoising to produce a filtered signal so for use in modeler 1210. Applying the correct filtering scheme to noisy signal s_(no) can provide a crude, preliminary noise removal. The choice of the filtering scheme for filter block 1230 may depend on some knowledge of the noise-inducing channel and/or the original data or can be found experimentally to provide good performance for a particular system. For example, a median filter may be appropriate for a channel introducing impulse noise, and a Wiener filter or a low pass filter may be best for rough filtering when a channel introduces Gaussian noise. More generally, a filter type and filter parameters that improve image or data quality can be identified through experiment. Filter 1230 preferably reduces the effect of the noise on context modeling in modeler 1210, but filter 1230 should not become a source of context modeling degradation. For example, a low pass filter can reduce the effect of Gaussian noise, but an aggressive (low cutoff frequency) could also blur the image and destroy borders.

An input selection system 1240 selects either pre-filtered signal s₀ or an intermediate recovered signal s_(rc) as a context signal s_(i) for modeler 1210. Modeler 1210 uses the context signal s_(i) to identify contexts η and/or context classes C(η). Modeler 1210 also receives the original noisy signal s_(no) and uses the noisy signal s_(no) to identify the current symbol a for each context η.

Using a pre-filtered signal s₀ can simplify identification of contexts having similar statistics and therefore provide an improved model of the noisy signal s_(no) even when the rough denoising that filter 1230 provides is far from optimal. For example, a median filter generally makes strong assumptions about the smoothness of data, with no use of context information, and thus fails to faithfully preserve some edges in an image. However, a median filter can still reduce the effect of impulse noise and produce an image that is faithful enough to serve as a basis for the identification of matching or similar contexts.

In an exemplary embodiment of the invention, modeler 1210 increments a component count of class count vector M(s_(no),s_(i),C(η)) for each occurrence of a context η in the context signal s_(i). However, the index [a−{double overscore (η)}] that identifies the component of the class count vector incremented depends on the symbol a from a position in noisy signal s_(no) corresponding to the position of the context η in context signal s_(i). The class count vector M(s_(no),s_(i),C(η)) can thus be thought of as a function of both the noisy signal s_(no) and the context signal s_(i), although signals s_(no) and s_(i) are not strictly independent.

Denoiser 1220 uses the class count vectors M(s_(no),s_(i),C(η)) from modeler 1210, a channel model 1222, and a cost or distortion model 1224 to select replacement symbols. Channel model 1222 corresponds to the symbol-transition-probability matrix or channel matrix Π described above and can be used to model different types of channel noise such as Gaussian noise or impulse noise. Distortion model 1224 corresponds to the symbol-transformation distortion matrix Λ described above. In one embodiment of the invention, denoiser 1220 identifies contexts in context signal s_(i) but applies the symbol replacement to noisy signal s_(no) to produce a denoised or reconstructed signal s_(rc).

The fact that the denoiser 1220 is a filter allows use of denoiser 1220 for rough denoising in a recursive or iterative denoising process. System 1200 achieves this configuration through operation of input selection system 1240 so that reconstructed signal s_(rc) from denoiser 1220 becomes the context signal s_(i) input to modeler 1210. An advantage of using denoiser 1220 and DUDE for rough denoising is that the DUDE can work well for denoising even if the data model assumed for the original data is far from perfect. Accordingly, when the noise-inducing channel is not well enough known for selection of a good filter operation for filter block 1230, filter block 1230 can be eliminated or can perform no filtering, and denoiser 1220 can perform the rough denoising after an initial modeling scan of the noisy signal s_(no). In particular, the recursive or iterative pre-filtering using denoiser 1220 can be activated, for example, after system 1200 has processed a sufficient number of symbols and contexts.

FIG. 13B is a flow diagram of an exemplary denoising process 1350 that can be implemented in system 1250 of FIG. 12B. Denoising process 1350 optionally begins with a step 1330 of filtering noisy signal s_(no) to produce an initial context signal s_(i). As noted above, the filter operation can be selected according to known characteristics of the noise-inducing channel and/or the original data, can be a filter operation found by experiment to be effective, or can be skipped if only the DUDE is used for iterative denoising. After filtering step 1330, process includes a series of one or more repetitions of a modeling pass 1315 and a denoising pass 1325.

Modeling pass 1315 includes steps 1312, 1313, 1314, 1316, 1317, and 1318, which are performed in substantially the same manner as described above in regard to modeling pass 1310 of FIG. 13A. A primary difference between modeling pass 1310 of FIG. 13A and modeling pass 1315 of FIG. 13B is that step 1312 in modeling pass 1315 selects the current context η from context signal s_(i) instead of the noisy signal s_(no). Otherwise, for each current symbol a from noisy signal s_(no) and the corresponding current context η from context signal s_(i), modeling pass 1315 determines a base symbol {overscore (η)} for the current context η (step 1313), determines a quantized difference context Q(Δη) from the current context η and base symbol {overscore (η)} (step 1314), determines an index base symbol {double overscore (η)} for the current context η (step 1316), and increments in class count M(s_(no),s_(i),C(η)) a component corresponding to the current symbol a from the noisy signal s_(no) and index base symbol {overscore (η)} (step 1317). Each execution of modeling pass 1315 continues until step 1318 indicates modeling pass 1315 is complete, e.g., after an entire image or a sufficient number of contexts have been processed to generate accurate class count vectors M(s_(no),s_(i),C(η)) .

Denoising pass 1325 includes steps 1322, 1323, 1324, 1326, 1327, and 1328, which are substantially similar to the corresponding steps of denoising pass 1320 described above in regard to FIG. 13A. A primary difference between denoising passes 1325 and 1320 is that step 1322 in denoising pass 1325 of FIG. 13B identifies a current context η in the context signal s_(i) that corresponds to the current symbol a_(a) in the noisy signal s_(no). Otherwise for each symbol a_(a) from the noisy signal s_(no) and corresponding context η from the context signal s_(i), denoising pass 1325 finds the class count vector M(s_(no),s_(i),C(η)) for the current context η (step 1323), constructs a count vector m(s_(no),s_(i),η) (step 1324), finds a replacement a_(x) that minimizes m^(T)(s_(no),s_(i),η)Π⁻¹(λ_(a) _(x) ⊙π_(a) _(a) ) (step 1326), and replaces the current symbol a_(a) in the noisy signal s_(no) with the identified symbol a_(x) (step 1327). Denoising pass 1325 continues until step 1328 determines that the last symbol has been denoised.

A step 1340 determines whether the last iteration of modeling pass 1315 and denoising pass 1325 have been completed. If another iteration is desired, a step 1345 sets the context signal s_(i) equal to the reconstructed signal s_(rc), and process 1350 branches back to repeat modeling pass 1315.

The determination in step 1340 of whether last iteration is complete can use criteria that differ for different embodiments of process 1350. For example, in one embodiment, process 1350 performs a fixed number of iterations of modeling pass 1315 and denoising pass 1325 and stops when that number of iterations is complete. In another embodiment, step 1340 can compare the reconstructed signal the current and previous iterations and determine whether further iterations are expected to improve image quality. For example, if a measure of the difference between the reconstructed signal for two consecutive iterations is sufficiently small, further iterations may be expected to provide little further improvement in the reconstructed data. In yet another embodiment, step 1340 for a denoised image relies on user input that indicates which iteration provides an image that the user subjectively finds best.

Inversion of Near-Singular Channel Models

The DUDE processes as described above use the product of the inverse channel matrix Π⁻¹ and an empirical count vector m(s_(no),η), for example, as indicated in Equation 2 above, when determining the denoised symbol values. Ideally, the product m^(T)(s_(no),η)Π⁻¹ for these processes is approximately proportional (or equal if count vector m(s_(no),η) is normalized) to a probability vector p indicating the probabilities of finding symbols in context η in the original/clean signal. However, the channel matrix Π can often be singular or near singular, and statistical fluctuations in the experimentally determined count vector m(s_(no),η) can cause the product m^(T)(s_(no),η)Π⁻¹ to differ significantly from the desired probability vector p. This section describes how DUDE can be adapted to find a probability vector p such that p^(T)Π is closest to m^(T) (normalized) in L₂ or square norm. The solution avoids directly computing m^(T)(s_(no),η)Π⁻¹ and projecting that vector on to the probability simplex because such a direct process could blow up the statistical fluctuations in count vector m(s_(no),η).

One embodiment of the invention employs a pseudo inverse in place of inverse channel matrix Π⁻¹ when a singular value decomposition of the channel matrix Π has a low condition number, i.e., a relatively low value for the ratio of the maximum and minimum singular values found in the decomposition. In an exemplary embodiment of this process, a pseudo inverse Pinv(Π′) can be computed via a singular value decomposition of the channel matrix Π followed by elimination of the smallest singular values. As described further below, matrix Π′ is a singular matrix that is obtained from channel matrix Π by insertion of 0 in place of small-magnitude entries in a diagonal matrix found through the singular value decomposition of channel matrix Π. Under specific conditions, pseudo inverse matrix Pinv(Π′) is similar to inverse channel matrix Π⁻¹ but avoids amplification of statistical fluctuations in the count vectors, and use of the pseudo inverse matrix Pinv(Π′) in place of inverse matrix Π⁻¹ in determination of denoised data improves denoising performance by improving the estimate of statistical properties of the original signal. However, if the condition number of the channel matrix Π is too high, determination of a pseudo inverse Pinv(Π′) may discard too many of the diagonal values, and estimation techniques based on expansion of count vectors in terms of the rows of the channel matrix as described further below can be used in determination of denoised data.

FIG. 14 is a flow diagram of a process 1400 for determining a denoised value. Process 1400 begins with an evaluation 1410 of channel matrix Π to determine whether the inverse channel matrix Π⁻¹ is suitable for numeric determination of denoised values. In an exemplary embodiment, the evaluation of channel matrix Π includes a step 1412 of determining a determinant det(Π) of the channel matrix Π and a step 1414 of determining the condition number for channel matrix Π. A decision step 1420 then decides whether to use the inverse matrix Π⁻¹ in generating denoised data. If inverse channel matrix Π⁻¹ is used, step 1425 determines a symbol a_(R) that replaces symbol a_(a) in context 71 using Equation 3 (or equivalently Equation 2 as described above.) In Equation 3, count vector m^(T)(s_(no),η) is the empirical count vector of symbols in context η within the noisy data s_(no) or can be generated from a class count vector as described above, matrix Π⁻¹ is the inverse of the channel matrix, and vector λ_(a) _(x) ⊙π_(a) _(a) is the Schur product of columns a_(x) and a_(a) respectively of the distortion and channel matrices Λ and Π. Equation  3: ${a_{R}\left( {\alpha,\eta} \right)} = {\underset{a_{x} = {a_{1}\quad{to}\quad a_{n}}}{argmin}\left\lbrack {{m^{T}\left( {s_{no},\eta} \right)}{\prod\limits^{- 1}\left( {\lambda_{a_{x}} \odot \pi_{a_{\alpha}}} \right)}} \right\rbrack}$

If the inverse channel matrix Π⁻¹ is not being used, step 1430 determines whether a pseudo inverse matrix Pinv(Π′) of the channel matrix is suitable. In the illustrated embodiment of the invention, the pseudo inverse matrix Pinv(Π′) is the Moore-Penrose inverse, but more generally, other generalized matrix inverses could be used. The Moore-Penrose inverse can be found as illustrated in steps 1432, 1434, 1435, 1436, and 1438 of FIG. 14. When determining the pseudo inverse, step 1432 performs a singular value decomposition (SVD) of the channel matrix Π as indicated in Equation 4. In Equation 4, each of matrices U and V is an orthogonal matrix. Matrix S in Equation 4 is a non-negative diagonal matrix. Π=U·S·V ^(T)   Equation 4

Step 1434 determines the number of diagonal coefficients of matrix S that are less than a threshold t. In an exemplary embodiment, Equation 5 gives the threshold t in terms of the largest coefficient s₀ of matrix S and the smallest dimension m or n of the channel matrix Π. In general, the channel matrix will be square (n=m) when the alphabets for the clean and noisy signals are the same. The small coefficients of matrix S can be sources of instability in numerical evaluations of inverse Π⁻¹ and can be ignored in the pseudo inverse Pinv(Π′) as described further below. However, if too many of the diagonal coefficients of diagonal matrix S are ignored, the product m^(T)(s_(no),η)Pinv(Π′) will fail to properly characterize the statistical properties of the clean data, and a decision step 1435 determines that an estimation process 1450 should be used as described further below in the determination of the denoised symbol a_(R). t=0.0001 min(m,n)s _(o)

Pseudo inverse Pinv(Π′) is preferably used if the channel matrix Π has a determinant that is less than about 0.001 and a condition number that is less than 50. In which case, determination 1430 of pseudo inverse Pinv(Π′) continues with the step 1436 of generating a diagonal matrix S⁺ that is found by replacing each coefficient s_(i) that is greater than or equal to threshold t in diagonal matrix S with multiplicative inverse s_(i) ⁻¹ and replacing coefficient s_(i) that is less than threshold t in diagonal matrix S with 0. Step 1438 sets pseudo inverse Pinv(Π′) equal to VS⁺U^(T). In a manner similar to that described above for the DUDE, a probability vector p^(T)(η) can be estimated from the product m^(T)(s_(no),η)Pinv(Π′) in step 1440, and the denoised symbol a_(R) can then be determined in step 1445 using Equation 6. As noted further below, the product m^(T)(s_(no),η)Pinv(Π′) may be a probability vector p^(T)(η) or may require adjustment to create the probability vector p^(T)(n). Equation  6: ${a_{R}\left( {a_{\alpha},\eta} \right)} = {\underset{a_{x} = {a_{1}\quad{to}\quad a_{n}}}{argmin}\left\lbrack {{p^{T}(\eta)}\left( {\lambda_{a_{x}} \odot \pi_{a_{\alpha}}} \right)} \right\rbrack}$

Channel matrix Π in some cases is such that neither inverse Π⁻¹ nor pseudo inverse Pinv(Π′) provides an accurate numeric projection of empirical count vectors m(s_(no),η) from the noisy signal s_(no) back to the space of the clean signal s_(cl). In these cases, an estimation process 1450 can be used to effectively project the empirical count vector m(s_(no),η) on to the space of the probability vectors p(s_(no),η) for clean signal s^(cl). More specifically, an estimation process can iteratively determine an expansion for count vector m(s_(no),η) in terms of the rows of channel matrix Π and use that expansion to identify a probability vector p(s_(no),η) such that p^(T)(s_(no),η)Π yields the (normalized) count vector m^(T)(s_(no),η). (The arguments of vectors m and p, which identify the noisy signal s_(no) and context η, are sometimes omitted below to simplify expressions.) The probability vector p^(T) thus determined can be used in place of m^(T)Π⁻¹ when finding the denoised symbols.

FIG. 15 illustrates an exemplary embodiment of an estimation process 1500 for a probability vector p that upon transmission through the noisy channel results in a count vector m. Estimation process 1500 uses an iterative process to construct an expansion of count vector m in terms of the rows of channel matrix Π. Step 1510 begins process 1500 by setting a solution for probability vector p to an initial value (e.g., to zero). Step 1520 then finds the row {overscore (π)}_(i) of channel matrix Π having the largest dot product with count vector m. The component p_(i) of solution vector p corresponding to the identified row {overscore (π)}_(i) of channel matrix Π is then incremented in step 1530 using the formula of Equation 7. In Equations 7 and 8, ∥{overscore (π)}_(i)∥ is the squared norm or magnitude of row vector {overscore (π)}_(i), and β is a constant less than one, for example, about equal to 0.1. In general, constant β is selected so that the solution vector p does not converge prematurely. Step 1540 then subtracts from vector m a contribution as indicated in Equation 8 to account for the addition to vector p. Equation  7: $\left. p_{i}\rightarrow{p_{i} + {\beta\frac{m \cdot \overset{\_}{\pi_{i}}}{\overset{\_}{\pi_{i}}}}} \right.$ Equation  8: $\left. m\rightarrow{m - {\beta\frac{m \cdot \overset{\_}{\pi_{i}}}{\overset{\_}{\pi_{i}}}\overset{\_}{\pi_{i}}}} \right.$

Steps 1520, 1530, and 1540 are repeated until a decision step 1550 determines that the iterations are finished. The iterations may be deemed finished when, for example, the sum of the components of the normalized probability vector p is 1, a predetermined maximum number of iterations have been executed, or the energy remaining in count vector m is below a predetermined threshold. At this point, probability vector p can be renormalized to have a magnitude of 1 and or checked for negative components as described further below. For determination of the denoised values, the identified probability vector p for an empirical count vector m can be used in place of m^(T)Π⁻¹ as shown in step 1560 and Equation 9. Equation  9: ${a_{R}\left( {a_{\alpha},\eta} \right)} = {\underset{a_{x} = {a_{1}\quad{to}\quad a_{n}}}{argmin}\left\lbrack {p \cdot \left( {\lambda_{a_{x}} \odot \pi_{a_{\alpha}}} \right)} \right\rbrack}$

The empirical nature of count vectors m can sometimes lead to the probability vector p^(T), m^(T)Pinv(Π′), or m^(T)Π⁻¹ having one or more negative components. When this occurs, a correction process can project the probability vector p^(T), m^(T)Pinv(Π′), or m^(T)Π⁻¹ to a vector p* having only non-negative components.

FIG. 16 illustrates an exemplary process 1600 for producing a non-negative vector p* from a vector p that may have negative components. Process 1600 begins with a step 1610 of setting vector p* equal to the vector p. At this point, vector p* may have negative components. Step 1620 sets all of the negative components of p* to zero. Eliminating the negative components may cause the sum of the component probabilities in vector p* to be greater than 1.

Decision step 1630 checks to see whether the sum of the components of vector p* is greater than 1. If not, process 1600 is done and vector p* has only non-negative components that sum to 1, as generally required for a probability vector. If the sum of the components of vector p* is greater than 1, process 1600 branches from step 1630 to step 1640. Step 1640 identifies the smallest positive component x of vector p* and determines a per-component difference δ, which is a ratio of the difference between the sum of the components of vector p* and 1 and the number of positive components.

Step 1650 then determines whether the per-component difference 6 is greater than the smallest positive component x. If not, step 1660 subtracts per-component difference δ from each positive component, leaving vector p* with components that sum up to 1 as required of a probability vector. Otherwise, step 1670 subtracts the smallest positive component from each of the positive components and then branches back to step 1640. Each execution of step 1670 sets the prior smallest positive component to zero and decreases the sum of the components of vector p* by less than the previous difference from 1. After a sufficient number of repetitions, the per-component difference 6 will be smaller than the smallest component, and process 1600 will execute step 1660 and end.

Although the invention has been described with reference to particular embodiments, the description is only an example of the invention's application and should not be taken as a limitation. Various adaptations and combinations of features of the embodiments disclosed are within the scope of the invention as defined by the following claims. 

1. A process comprising: applying a first denoising process to a first signal to produce a second signal; selecting a current symbol from a first signal; identifying a current context that is in the second signal and associated with a position of the current symbol; updating a data structure to reflect occurrence of the current symbol in the current context; repeating the selecting step, the identifying step, and the updating step a plurality of times; and denoising the first signal to generate a third signal, wherein the denoising uses the data structure to determine whether to replace a symbol in the first signal.
 2. The process of claim 1, wherein the data structure comprises a first count vector corresponding to a first context in the second signal, and denoising the first signal comprises: identifying a symbol having a value I in the first signal at a position corresponding to the first context in the second signal; using the first count vector, a channel model, and a signal degradation model to identify a value J that is estimated to reduce overall image degradation in the third signal relative to an original signal when the value J replaces the value I in the first context, wherein the channel model indicates a probability for a channel to convert an input symbol having a first value to a received symbol having a second value, and the signal degradation model indicates signal degradation that occurs if a symbol having the value I is replaced by another symbol value in the original signal; and using in the third signal the value J in place of each occurrence of the value I that is in the first signal and corresponds to the first context in the second signal.
 3. The process of claim 1, wherein the denoising the first signal comprises: constructing from the data structure a first count vector corresponding to a first context in the second signal; identifying a symbol having a value I in the first signal at a position corresponding to the first context in the second signal; using the first count vector, a channel model, and a signal degradation model to identify a value J that is estimated to reduce overall image degradation in the third signal relative to an original signal when the value J replaces the value I in the first context, wherein the channel model indicates a probability for a channel to convert an input symbol having a first value to a received symbol having a second value, and the signal degradation model indicates signal degradation that occurs if a symbol having the value I is replaced by another symbol value in the original signal; and using in the third signal the value J in place of each occurrence of the value I that is in the first signal and corresponds to the first context in the second signal.
 4. The process of claim 1, wherein the first denoising process is selected from the group consisting of a median filter, a Wiener filter, a low pass filter, and a discrete universal denoising process.
 5. The process of claim 1, further comprising: replacing the second signal with the third signal; and then selecting a current symbol from a first signal; identifying a current context that is in the replaced second signal and associated with a position of the current symbol; updating a data structure to reflect occurrence of the current symbol in the current context; repeating the selecting step, the identifying step, and the updating step a plurality of times; and denoising the first signal to generate a new third signal, wherein the denoising uses the data structure to determine whether to replace a symbol in the first signal.
 6. The process of claim 5, further comprising repeating the steps of claim 5 a fixed number of times.
 7. The process of claim 5, further comprising repeating the steps of claim 5 until a measure of a difference between the second signal and the third signal is less than a threshold value.
 8. One or more computer-readable media containing computer-executable instructions that, when executed by a processor, perform a process comprising: applying a first denoising process to a first signal to produce a second signal; selecting a current symbol from a first signal; identifying a current context that is in the second signal and associated with a position of the current symbol; updating a data structure to reflect occurrence of the current symbol in the current context; repeating the selecting step, the identifying step, and the updating step a plurality of times; and denoising the first signal to generate a third signal, wherein the denoising uses the data structure to determine whether to replace a symbol in the first signal.
 9. The media of claim 8, wherein the first denoising process is selected from the group consisting of a median filter, a Wiener filter, a low pass filter, and a discrete universal denoising process.
 10. The media of claim 8, wherein the process further comprising: replacing the second signal with the third signal; and then selecting a current symbol from a first signal; identifying a current context that is in the replaced second signal and associated with a position of the current symbol; updating a data structure to reflect occurrence of the current symbol in the current context; repeating the selecting step, the identifying step, and the updating step a plurality of times; and denoising the first signal to generate a new third signal, wherein the denoising uses the data structure to determine whether to replace a symbol in the first signal.
 11. A denoising system comprising: a modeler connected to receive a first signal and a second signal, wherein the modeler processes the first signal to identify symbol values and processes the second signal to identify contexts respectively associated with the symbol values identified, wherein the modeler generates a data structure that indicates probabilities for occurrences of symbols in contexts; and a denoiser that receives the data structure, the symbols from the first signal, and the contexts from the second signal, wherein the denoiser generates a third signal from the first signal by using the data structure to determine whether to replace a symbol in the first signal when generating the third signal.
 12. The system of claim 11, wherein the modeler processes the first signal and the second signal by executing a process including: selecting a current symbol from the first signal; determining a current context in the second signal that corresponds to a position of the current symbol; and updating the data structure to reflect an occurrence of the current symbol in the current context; and repeating the above steps a plurality of times.
 13. The system of claim 11, wherein the data structure comprises a first count vector corresponding to a first context in the second signal, and the denoiser processes the first signal by executing a process including: identifying a symbol having a value I in the first signal at a position corresponding to the first context in the second signal; using the first count vector, a channel model, and a signal degradation model to identify a value J that is estimated to reduce overall image degradation in the third signal relative to an original signal when the value J replaces the value I in the first context, wherein the channel model indicates a probability for a channel to convert an input symbol having a first value to a received symbol having a second value, and the signal degradation model indicates signal degradation that occurs if a symbol having the value I is replaced by another symbol value in the original signal; and using in the third signal the value J in place of each occurrence of the value I that is in the first signal and corresponds to the first context in the second signal.
 14. The process of claim 11, wherein the denoiser processes the first signal by executing a process including constructing from the data structure a first count vector corresponding to a first context in the second signal; identifying a symbol having a value I in the first signal at a position corresponding to the first context in the second signal; using the first count vector, a channel model, and a signal degradation model to identify a value J that is estimated to reduce overall image degradation in the third signal relative to an original signal when the value J replaces the value I in the first context, wherein the channel model indicates a probability for a channel to convert an input symbol having a first value to a received symbol having a second value, and the signal degradation model indicates signal degradation that occurs if a symbol having the value I is replaced by another symbol value in the original signal; and using in the third signal the value J in place of each occurrence of the value I that is in the first signal and corresponds to the first context in the second signal.
 15. The system of claim 11, further comprising a filter that generates the second signal from the first signal.
 16. The system of claim 15, wherein the filter is selected from the group consisting of a median filter, a Wiener filter, and a low pass filter.
 17. The system of claim 11, wherein the third signal from the denoiser is applied as the second signal input to the modeler.
 18. The system of claim 11, further comprising: a filter to which the first signal is applied as an input; and a switch operable to select between a signal output from the filter and the third signal output from the denoiser as the second signal input to the modeler. 